Towards a closer integration of finite domainpropagation and simplex-based algorithms

This paper describes our experience in implementing an industrial application using the Finite Domain solver of the ECL i PS e Constraint Logic Programming (CLP) system, in conjunction with the Mathematical Programming (MP) system, FortMP. In this technique, the ECL i PS e system generates a feasible solution that is adapted to construct a starting point (Basic solution) for the MP solver. The Basic solution is then used as an input to the FortMP system to warm-start the Simplex (SX) algorithm, hastening the solution of the linear programming relaxation, (LPR). SX proceeds as normal to nd the optimal integer solution. Preliminary results indicate that the integration of the two environments is suitable for for this application in particular, and may generally yield signiicant bene-ts. We describe adaptations required in the hybrid method, and report encouraging experimental results for this problem.